Matroid 3-connectivity and branch width
نویسندگان
چکیده
We prove that, for each nonnegative integer k and each matroid N , if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a k-element set X ⊆ E(M) such that one of M \X and M/X is 3-connected and contains N as a minor.
منابع مشابه
Testing branch-width
An integer-valued function f on the set 2V of all subsets of a finite set V is a connectivity function if it satisfies the following conditions: (1) f(X) + f(Y ) ≥ f(X ∩Y )+ f(X ∪Y ) for all subsets X, Y of V , (2) f(X) = f(V \X) for all X ⊆ V , and (3) f(∅) = 0. Branch-width is defined for graphs, matroids, and more generally, connectivity functions. We show that for each constant k, there is ...
متن کاملFork-decompositions of ?\iatroids
One of the central problems in matroid theory is Rota's conjecture that, for all prime powers q, the class of GF(q)-representable matroids has a finite set of excluded minors. This conjecture has been settled for q s; 4 but remains open otherwise. Further progress towards this conjecture has been hindered by the fact that, for all q > 5, there are 3-connected GF(q)-representable matroids having...
متن کاملFork-decompositions of Matroids
One of the central problems in matroid theory is Rota’s conjecture that, for all prime powers q, the class of GF (q)–representable matroids has a finite set of excluded minors. This conjecture has been settled for q ≤ 4 but remains open otherwise. Further progress towards this conjecture has been hindered by the fact that, for all q > 5, there are 3–connected GF (q)–representable matroids havin...
متن کاملA Parametrized Algorithm for Matroid Branch-Width
Branch-width is a structural parameter very closely related to tree-width, but branch-width has an immediate generalization from graphs to matroids. We present an algorithm that, for a given matroid M of bounded branch-width t which is represented over a finite field, finds a branch decomposition of M of width at most 3t in cubic time. Then we show that the branch-width of M is a uniformly fixe...
متن کاملAmalgam Width of Matroids
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids, while still allowing the algorithmic application on non-representable matroids (which is not possible for branch-width). In particular, any property expressible in the monadic second order lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 112 شماره
صفحات -
تاریخ انتشار 2015